Depth-based Local Search Heuristics for Boolean Circuit Satisfiability
نویسندگان
چکیده
We propose a structure-exploiting heuristic for the justification-based stochastic local search (SLS) method CRSat for Boolean circuit satisfiability. Experimental evaluation shows that the proposed depth-based heuristic significantly improved the performance of CRSat on structural instances arising from industrial applications. A proof of probabilistically approximate completeness (PAC) of CRSat relies on the same kind of variable ordering as the one imposed by the depth-based heuristic, and hence provides a theoretical motivation for the heuristic. Furthermore, we compare the behavior of (depth-based) CRSat to that of the justification-based SLS method BC SLS driven by justification frontiers.
منابع مشابه
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from realworld industrial SAT application domains. The recently introduced SLS method CRSAT has been shown to noticeably improve on previously suggested SLS techniques in solving such real-world instances by combining justification-based local search with l...
متن کاملSearch, Satisfiability, and Constraint Satisfaction Problems
When not enough time is available to fully explore a search tree, different algorithms will visit different leaves. Depth-first search and depth-bounded discrepancy search, for example, make opposite assumptions about the distribution of good leaves. Unfortunately, it is rarely clear a priori which algorithm will be most appropriate for a particular problem. Rather than fixing strong assumption...
متن کاملAutomated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search heuristics for SAT. We show that several well-known SAT local search algorithms such as Walksat and Novelty are composite heuristics that are derived...
متن کاملDepth-Driven Circuit-Level Stochastic Local Search for SAT
We develop a novel circuit-level stochastic local search (SLS) method D-CRSat for Boolean satisfiability by integrating a structure-based heuristic into the recent CRSat algorithm. D-CRSat significantly improves on CRSat on real-world application benchmarks on which other current CNF and circuit-level SLS methods tend to perform weakly. We also give an intricate proof of probabilistically appro...
متن کاملIncomplete Tree Search using Adaptive Probing
When not enough time is available to fully explore a search tree, different algorithms will visit different leaves. Depth-first search and depth-bounded discrepancy search, for example, make opposite assumptions about the distribution of good leaves. Unfortunately, it is rarely clear a priori which algorithm will be most appropriate for a particular problem. Rather than fixing strong assumption...
متن کامل